'''
求两个整数的最小公倍数
思路：
1. 辗转相除法求出最大公约数 g，
2. 由短除法可知道，最小公倍数为 x1/g * x2/g * g = x1 * x2 / g
'''


class Solution:
    def find_lcm(self,input01: int, input02: int) -> int: # lcm = Least common multiple
        def gcd(a:int, b :int)->int: # gcd = greatest common divisor
            if b == 0:
                return a
            return gcd(b, a % b)

        return int(input01 * input02 / gcd(input01, input02))


s = Solution()

input01, input02 = 35, 15
print(s.find_lcm(input01, input02))

input_list = list(map(int, input().split()))
print(s.find_lcm(input_list[0], input_list[1]))






